Mtac2: typed tactics for backward reasoning in Coq
نویسندگان
چکیده
منابع مشابه
Tactics for Reasoning Modulo AC in Coq
We present a set of tools for rewriting modulo associativity and commutativity (AC) in Coq, solving a long-standing practical problem. We use two building blocks: first, an extensible reflexive decision procedure for equality modulo AC; second, an OCaml plug-in for pattern matching modulo AC. We handle associative only operations, neutral elements, uninterpreted function symbols, and user-defin...
متن کاملMechanized Reasoning for Binding Constructs in Typed Assembly Language Using Coq
Mechanized reasoning about programming languages and type systems is becoming increasingly important for the development of certified code frameworks. For instance, in order to realize the safety and security potential of proof-carrying code (PCC) [3] the development of formal, machine-checkable proofs is a necessity. Much of the difficulty and research surrounding PCC involves the generation o...
متن کاملInitial Semantics for higher-order typed syntax in Coq
Initial Semantics aims at characterizing the syntax associated to a signature as the initial object of some category. We present an initial semantics result for typed syntax with variable binding together with its formalization in the Coq proof assistant. The main theorem was first proved on paper in the second author’s PhD thesis in 2010, and verified formally shortly afterwards. To a simply–t...
متن کاملNominal Reasoning Techniques in Coq
We explore an axiomatized nominal approach to variable binding in Coq, using an untyped lambda-calculus as our test case. In our nominal approach, alpha-equality of lambda terms coincides with Coq’s builtin equality. Our axiomatization includes a nominal induction principle and functions for calculating free variables and substitution. These axioms are collected in a module signature and proved...
متن کاملA Formalization of the Simply Typed Lambda Calculus in Coq
In this paper we present a formalization of the simply typed lambda calculus with constants and with typing à la Church. It has been accomplished using the theorem prover Coq. The formalization includes, among other results, definitions of typed terms over arbitrary many-sorted signature, a substitution operating on typing judgements, an equivalence relation generalizing the concept of α-conver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2018
ISSN: 2475-1421
DOI: 10.1145/3236773